Model checking of state-rich formalism by linking to $$CSP\,\Vert \,B$$ C S P ‖ B
نویسندگان
چکیده
منابع مشابه
S P R T C B G
This paper analyzes a certain class of combinatorial board games that includes Ayo, Tchoukaillon and Modular N–queen. We refine the existing results by providing simple and intuitive proofs using abstract combinatorics, and also reveal some interesting game positions.
متن کاملLinking Semantic Models to Support CSP || B Consistency Checking
Consistency checking in the CSP ‖ B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outside its precondition. Previously this was done by preprocessing the CSP process to perform a weakest precondition semantics proof. An embedding of the CSP traces model already exists in the PVS theorem prover, which ma...
متن کاملT L C S C B C
In a computational process, certain entities (for example sets or arrays) and operations on them may be automatically available, for example by being provided by the programming language. We define background classes to formalize this idea, and we study some of their basic properties. The present notion of background class is more general than the one we introduced in an earlier paper, and it t...
متن کاملProof Assisted Symbolic Model Checking for B and Event-B
We have implemented various symbolic model checking algorithms, like BMC, k-Induction and IC3 for B and Event-B. The high-level nature of B and Event-B accounts for complicated constraints arising in these symbolic analysis techniques. In this paper we suggest using static information stemming from proof obligations to simplify occurring constraints. We show how to include proof information in ...
متن کاملParallel Model Checking of B Specifications
Model checking of a specification using ProB can easily become a task with a long running time. However, the task can very easily be parallelized. If we had a transition system (the state space) and an invariant we could partition the vertices of the state space into k partitions of equal size and then check the invariant on k processors in parallel. However, in reality we cannot afford to prec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2015
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-015-0402-1